Sweep as a generic pruning technique

Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint

Sweep as a Generic Pruning Technique Applied to Constraint Relaxation

We introduce a new generic filtering algorithm for handling constraint relaxation within constraint programming. More precisely, we first present a generic pruning technique which is useful for a special case of the cardinality operator where all the constraints have at least two variables in common. This method is based on a generalization of a sweep algorithm which handles a conjunction of co...

Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family

The paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One original contribution is to provide a geometrical interpretation of these rules that can be used by a generic sweep pruning algorithm. Finally one practical interest of the paper is to describe an implementation of the number of distinct values constr...

Research Report: Infimaximal Frames A Technique for Making Lines Look Like Segments

Many geometric algorithms that are usually formulated for points and segments generalize easily to inputs also containing rays and lines. The sweep algorithm for segment intersection is a prototypical example. Implementations of such algorithms do, in general, not extend easily. For example, segment endpoints cause events in sweep line algorithms, but lines have no endpoints. We describe a gene...

Kinetic Sweep and Prune for Collision Detection

We propose an acceleration scheme for real-time many-body dynamic collision detection. We kinetize the sweep and prune method for many-body collision pruning, extending its application to dynamic collision detection via kinetic data structures. In doing so, we modify the method from sample-rate driven to event-driven, with no more events than the original method processed, also removing the per...